A Logic Language Based on GAMMA-Like Multiset Rewriting
نویسندگان
چکیده
This paper describes Gammall og, a logic language based on multiset rewriting. The language combines the ability of describing parallel programs made of multiset transformation rules as in GAMMA with the execution model of logic programming in a strongly typed framework as in GG odel. We describe the design choices, the syntax and the semantics of the language, and a prototype implementation.
منابع مشابه
Gammall Og: a Coordination Language Based on Gamma and Gg Odel
This paper describes Gammall og, a logic language based on multiset rewriting. The language combines the ability of describing parallel programs made of multiset transformation rules as in GAMMA with the execution model of logic programming in a strongly typed framework as in GG odel. We describe the design choices, the syntax and the semantics. Gammall og provides a standard model theoretic se...
متن کاملA Logic Language based onGAMMA - like Multiset
Gammall og is a logic language based on multiset rewriting. The language combines the ability of describing parallel programs made of multiset transformation rules as in GAMMA with the execution model of logic programming in a strongly typed framework as in GG odel. We describe the design choices, the syntax, and the semantics. Gammall og has a standard model theoretic semantics expressed in te...
متن کاملThe Logical Meeting Point of Multiset Rewriting and Process Algebra: Progress Report
We present a revisited semantics for multiset rewriting founded on the left sequent rules of linear logic in its LV presentation. The resulting interpretation is extended with a majority of linear connectives into the language of ωmultisets. It drops the distinction between multiset elements and rewrite rules, and considerably enriches the expressive power of standard multiset rewriting with em...
متن کاملModular Multiset Rewriting in Focused Linear Logic
Traditional multiset rewriting arises from a fragment of polarized linear logic, deriving its semantics from focused proof search. In recent years, languages based on multiset rewriting have been used for ever more ambitious applications. As program size grows however, so does the overhead of team-based development and the need for reusing components. Furthermore, there is a point where keeping...
متن کاملType Checking for a Multiset Rewriting Language
We enhance Gamma, a multiset rewriting language, with a notion of structured multiset. A structured multiset is a set of addresses satisfying speci c relations which can be used in the rewriting rules of the program. A type is de ned by a context-free graph grammar and a structured multiset belongs to a type T if its underlying set of addresses satis es the invariant expressed by the grammar de...
متن کامل